Missing The Forest to Count the Trees: Spanning Tree Enumeration in Complete and Non-Complete Graphs
نویسنده
چکیده
Spanning trees have been studied extensively and have many practical applications. From astronomers using spanning trees to find quasar superstructures, to biomedical engineers detecting actin fibers in cell images tree enumeration remains an interesting problem. In this paper we examine a simple, practical, algebraic approach for the enumeration of spanning trees in complete and non-complete graphs based on Cayley’s formula and Kirchoff’s Theorem.
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملEnumerating spanning trees of graphs with an involution
As the extension of the previous work by Ciucu and the present authors (J. Combin. Theory Ser. A 112(2005) 105–116), this paper considers the problem of enumeration of spanning trees of weighted graphs with an involution which allows fixed points. We show that if G is a weighted graph with an involution, then the sum of weights of spanning trees of G can be expressed in terms of the product of ...
متن کاملMOD-CHAR: An Implementation of Char’s Spanning Tree Enumeration Algorithm and Its Complexity Analysis
Abstruct -An implementation, called MOD-CHAR, of Char’s spanning tree enumeration algorithm [3] is discussed. Two complexity analyses of MOD-CHAR are presented. It is shown that MOD-CHAR leads to better complexity results for Char’s algorithm than what could be obtained using the straightforward implementation implied in Char’s original presentation 131. The class of graphs for which MOD-CHAR a...
متن کاملCounting rooted spanning forests in complete multipartite graphs
Jin and Liu discovered an elegant formula for the number of rooted spanning forests in the complete bipartite graph a1;a2 , with b1 roots in the rst vertex class and b2 roots in the second vertex class. We give a simple proof to their formula, and a generalization for complete m-partite graphs, using the multivariate Lagrange inverse. Y. Jin and C. Liu [3] give a formula for f(m; l;n; k), the n...
متن کاملAsymptotic Enumeration of Spanning Trees
We give new formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay [Europ. J. Combin. 4 149–160] for regular graphs. The general answer involves a quantity for infinite graphs that we call ‘tree entropy’, which we show is a logarithm of a normalized determinant of the graph Laplacian for infinite graphs. Tree entropy is also exp...
متن کامل